Categorical fixed point semantics
نویسندگان
چکیده
منابع مشابه
Categorical Fixed Point Calculus
ion theorem, these operators can be lifted to _+ and _for arbitrary domain cat-egories E ; i.e. _+ and _are binary operators on the category Fun . They are, in fact,the coproduct and the product in Fun : by the parameterised limit theorem it followsthat (F _+G;inlF ;G;inrF ;G ) is the coproduct of F and G , where (inlF ;G)x = inlF:x;G:x andsimilarly for inrF ...
متن کاملComplete Axioms for Categorical Fixed-Point Operators
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We prove a general completeness theorem for iteration operators, relying on a new, purely syntactic characterisation of the free iteration theory. We then show how iteration operators arise in axiomatic domain theory. One re...
متن کاملFeedback, trace and fixed-point semantics
We introduce a notion of category with feedback-withdelay, closely related to the notion of traced monoidal category, and show that the Circ construction of [15] is the free category with feedback on a symmetric monoidal category. Combining with the Int construction of Joyal et al. [12] we obtain a description of the free compact closed category on a symmetric monoidal category. We thus obtain ...
متن کاملA Fixed Point Semantics for the ATMS
In CTW90], the ATMS resolution mechanisms have been formalized, using the concept of DK-tree. We propose in this paper a new and simple approach based on the xed point theory and an original demonstration of the completeness of these mechanisms. We rst introduce the basic deenitions of terms, sets and functions which are used in the paper and build a lattice. Then, the basic formal tools to des...
متن کاملGödel FL_0 with Greatest Fixed-Point Semantics
We study the fuzzy extension of FL0 with semantics based on the Gödel t-norm. We show that gfp-subsumption w.r.t. a nite set of primitive de nitions can be characterized by a relation on weighted automata, and use this result to provide tight complexity bounds for reasoning in this logic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90154-a